Edge-realizable graphs with universal vertices
نویسندگان
چکیده
منابع مشابه
Tetravalent edge-transitive Cayley graphs with odd number of vertices
A characterisation is given of edge-transitive Cayley graphs of valency 4 on odd number of vertices. The characterisation is then applied to solve several problems in the area of edge-transitive graphs: answering a question proposed by Xu (1998) regarding normal Cayley graphs; providing a method for constructing edge-transitive graphs of valency 4 with arbitrarily large vertex-stabiliser; const...
متن کاملCOSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملDetachment of Vertices of Graphs Preserving Edge-Connectivity
The detachment of vertex is the inverse operation of merging vertices s1, . . . , st into s. We speak about {d1, . . . , dt}-detachment if for the detached graph G′ the new degrees are specified as dG′(s1) = d1, . . . , dG′(st) = dt. We call a detachment k-feasible if dG′(X) ≥ k whenever X separates two vertices of V (G)−s. In our main theorem, we give a necessary and sufficient condition for t...
متن کاملEstimation of cut-vertices in edge-coloured complete graphs
All graphs considered here are finite simple graphs, i.e., graphs without loops, multiple edges or directed edges. For a graph G = (V, E), where V is a vertex set and E is an edge set, we write sometimes V (G) for V and E(G) for E to avoid ambiguity. We shall write G \ v instead of G V \{v} = (V \ {v}, E ∩ 2 V \{v}), the subgraph induced by V \ {v}. A vertex v ∈ V (G) is called a cut-vertex of ...
متن کاملConstructing Uniquely Realizable Graphs
In the Graph Realization Problem (GRP), one is given a graph G, a set of non-negative edge-weights, and an integer d. The goal is to find, if possible, a realization of G in the Euclidian space R, such that the distance between any two vertices is the assigned edge weight. The problem has many applications in mathematics and computer science, but is NP-hard when the dimension d is fixed. Charac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasgow Mathematical Journal
سال: 1991
ISSN: 0017-0895,1469-509X
DOI: 10.1017/s0017089500008375